A Tuning Aid for Discretization in Rule Induction

نویسنده

  • M. POSTEMA
چکیده

This paper examines where a tuning aid can be useful to help discretization of numerical attributes in rule induction, and subsequently improve deduction of induction results. Diierent discretizationmethods use diierent strategies to set up the borders for continuous attributes. They mostly incorporate class supervision to deene the discretization borders. The tuning aid we present uses an unsupervised method to deene the intervals at induction time. We then supervise the learning process, by comparing the performance in terms of predictive accuracy with the information gain based discretization methods implemented in HCV (Version 2.0) and C4.5.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Tuning Aid to Improve Deduction of Induction Results

This paper examines where a tuning aid can be useful to improve deduction of induction results. Diierent discretization methods use diierent strategies to set up the borders for continuous attributes. They mostly incorporate class supervision to deene the discretization borders. The tuning aid we present uses an unsupervised method to deene the intervals at induction time. We then supervise the...

متن کامل

Three discretization methods for rule induction

We discuss problems associated with induction of decision rules from data with numerical attributes. Real-life data frequently contain numerical attributes. Rule induction from numerical data requires an additional step called discretization. In this step numerical values are converted into intervals. Most existing discretization methods are used before rule induction, as a part of data preproc...

متن کامل

Rule Induction with Extension Matrices

This paper presents a heuristic, attribute-based, noise-tolerant data mining program, HCV (Version 2.0), based on the newly-developed extension matrix approach. By dividing the positive examples (PE) of a speciic class in a given example set into intersecting groups and adopting a set of strategies to nd a heuristic conjunctive formula in each group which covers all the group's positive example...

متن کامل

A Comparison of Three Strategies to Rule Induction from Data with Numerical Attributes

Our main objective was to compare two discretization techniques, both based on cluster analysis, with a new rule induction algorithm called MLEM2, in which discretization is performed simultaneously with rule induction. The MLEM2 algorithm is an extension of the existing LEM2 rule induction algorithm. The LEM2 algorithm works correctly only for symbolic attributes and is a part of the LERS data...

متن کامل

Three Strategies to Rule Induction from Data with Numerical Attributes

Rule induction from data with numerical attributes must be accompanied by discretization. Our main objective was to compare two discretization techniques, both based on cluster analysis, with a new rule induction algorithm called MLEM2, in which discretization is performed simultaneously with rule induction. The MLEM2 algorithm is an extension of the existing LEM2 rule induction algorithm, work...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997